Multi-item auctions for automatic negotiation

نویسندگان

  • Houssein Benameur
  • Brahim Chaib-draa
  • Peter G. Kropf
چکیده

Available resources can often be limited with regard to the number of demands. In this paper we propose an approach for solving this problem which consists of using the mechanisms of multi-item auctions for allocating the resources to a set of software agents. We consider the resource problem as a market in which there are vendor agents and buyer agents trading on items representing the resources. These agents use multi-item auctions which are viewed here as a process of automatic negotiation, and implemented as a network of intelligent software agents. In this negotiation, agents exhibit different acquisition capabilities which let them act differently depending on the current context or situation of the market. For example, the ”richer” an agent is, the more items it can buy, i.e. the more resources it can acquire. We present a model for this approach based on the English auction, then we discuss experimental evidence of such a model.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Comparative Study of Multi-Attribute Continuous Double Auction Mechanisms

Auctions have been as a competitive method of buying and selling valuable or rare items for a long time. Single-sided auctions in which participants negotiate on a single attribute (e.g. price) are very popular. Double auctions and negotiation on multiple attributes create more advantages compared to single-sided and single-attribute auctions. Nonetheless, this adds the complexity of the auctio...

متن کامل

Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search

A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...

متن کامل

Multi-attribute auctions for electronic procurement

Auctions are a fundamental mechanism to automate negotiations in electronic commerce. We consider a class of multi-lateral negotiation situations, which requires negotiation on multiple attributes of a deal. These situations are typical for corporate procurement. Current auction implementations do not support these negotiations adequately. In the paper we propose multi-attribute auctions, an ec...

متن کامل

Preference Elicitation and Winner Determination in Multi-Attribute Auctions

Multi-Attribute Reverse Auctions (MARAs) are excellent protocols to automate negotiation among sellers. Eliciting the buyer′s preferences and determining the winner are both challenging problems for MARAs. To solve these problems, we propose two algorithms namely MAUT* and CP-net*, which are respectively the improvement of the Multi-Attribute Utility Theory (MAUT) and constrained CP-net. The bu...

متن کامل

Jump bidding and overconcentration in decentralized simultaneous ascending auctions

A model of English auctions is proposed to incorporate the possibility of jump bidding. When two objects are sold separately via such auctions, bidders signal their willingness to pay via jump bids, thereby forming rational expectations of the prices without relying on any central mediator. Hence a multi-item bidder does not suffer the exposure problem of having to buy an item while he is uncer...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Information & Software Technology

دوره 44  شماره 

صفحات  -

تاریخ انتشار 2002